Inferring Strings from Position Heaps in Linear Time

Position heaps are index structures of text strings used for the string matching problem. They rooted trees whose edges and nodes labeled numbered, respectively. This paper is concerned with variants inverse problem position heap construction gives linear-time algorithms those problems. The basic to restore a from tree numbered nodes. In variant problems, input may miss edge labels or node numbers which we must as well.